-
1 combinatorial automaton
Большой англо-русский и русско-английский словарь > combinatorial automaton
-
2 combinatorial automaton
-
3 combinatorial automaton
Математика: комбинаторный автоматУниверсальный англо-русский словарь > combinatorial automaton
-
4 combinatorial automaton
English-Russian scientific dictionary > combinatorial automaton
-
5 automaton
-
6 automaton
автомат
– combinatorial automaton
– commutative automaton
– definite automaton
– deterministic automaton
– digital automaton
– finite automaton
– finite-memory automaton
– finite-state automaton
– fixed automaton
– growing automaton
– higher automaton
– input-restricted automaton
– Mealy automaton
– memoryless automaton
– Moore automaton
– noninitial automaton
– probabilistic automaton
– redundant automaton
– self-adaptive automaton
– self-moving automaton
– stochastic automaton
– trivial automaton
-
7 combinatorial
1) комбинаторный
2) комбинационный
3) сочетательный
– combinatorial analysis
– combinatorial automaton
– combinatorial definability
– combinatorial square
– combinatorial theory
– combinatorial topology -
8 matrix
1) мат. матрица || матричный2) форма, шаблон4) растр5) решётка6) таблица7) геол. материнская порода, основная масса ( породы)8) основа кристаллического вещества; кристаллическая решётка•- absolutely equivalent matrices - adjoint matrices - almost perfect matrix - almost periodic matrix - almost superdiagonal matrix - associative matrix - birth-death coefficient matrix - cocycle matrix - commutative matrix - commute matrices - commuting matrix - complex conjugate matrix - compound matrix - conjunctive matrices - consistently ordered matrix - constituent matrices - deficient matrix - doubly degenerated matrix - doubly stochastic matrix - encoding matrix - essentially positive matrix - magnetic core matrix - matrix of linear transformation - multiplicatively cogredient matrix - multiply degenerate matrix - mutually consistent matrices - nearly triangular matrix - negatively semidefinite matrix - nonnegatively semidefinite matrix - orthogonally similar matrices - positively definite matrix - positively semidefinite matrix - regularly partitioned matrix - strictly upper triangular matrix - strongly equivalent matrices - totally nonnegative matrix - totally positive matrix - totally unimodular matrix - uniformly tapered matrix - vertex incidence matrix - vertically symmetrical matrix - weakly cyclic matrix
См. также в других словарях:
Natural computing — For the scientific journal, see Natural Computing (journal). Natural computing, also called Natural computation, is a terminology introduced to encompass three classes of methods: 1) those that take inspiration from nature for the development of… … Wikipedia
List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… … Wikipedia
History of artificial intelligence — The history of artificial intelligence begins in antiquity with myths, stories and rumors of artificial beings endowed with intelligence and consciousness by master craftsmen. In the middle of the 20th century, a handful of scientists began to… … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
List of combinatorics topics — This is a list of combinatorics topics.A few decades ago it might have been said that combinatorics is little more than a way to classify poorly understood problems, and some standard remedies. Great progress has been made since 1960.This page is … Wikipedia
State transition table — In automata theory and sequential logic, a state transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite semiautomaton or finite state machine will move to, based on the current state … Wikipedia
John Horton Conway — Infobox Scientist name = John Horton Conway |300px image width = 300px birth date = birth date and age|1937|12|26|mf=y birth place = Liverpool, Merseyside, England residence = U.S. nationality = English death date = death place = field =… … Wikipedia
List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… … Wikipedia
DNA computing — is a form of computing which uses DNA, biochemistry and molecular biology, instead of the traditional silicon based computer technologies. DNA computing, or, more generally, biomolecular computing, is a fast developing interdisciplinary area.… … Wikipedia